منابع مشابه
An NP-Complete Fragment of LTL
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter.
متن کاملFirst-order satisfiability in Gödel logics: An NP-complete fragment
Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of many-valued logics. We investigate a first-order fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rule-based systems. The satisfiability problem in this fragment is shown to be NP-complete for all GV , also in ...
متن کامل3 An NP Complete Language
L = {x such that x is an acceptable Riemann Hypothesis proof} is in NP and therefore, using a reduction, we can come up with a circuit C that takes as input x and outputs 1 if x is a proof for the Riemann Hypothesis or 0 otherwise. Our goal now is to design a pair of PPT machines (Enc,Dec) such that: 1. Enc(C,m) takes as input the circuit C and m ∈ {0, 1} and outputs a ciphertext e ∈ {0, 1}∗. 2...
متن کاملThe Common Fragment of CTL and LTL
It is well-known that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete. By omitting path quantifiers, we get an inductive definition of the LTL formulas expressible in AC...
متن کاملThe Common Fragment of ACTL and LTL
The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where only universal path quantification is allowed. The common fragment of LTL and ACTL is shown to be strictly smaller than the common fragment of LTL and CTL. Furthermore, an algorithm is presented for deciding if an LTL formula can be expressed in ACTL. This algorithm uses an effe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2005
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054105003261